Random cluster dynamics for the Ising model is rapidly mixing

نویسندگان

  • Heng Guo
  • Mark Jerrum
چکیده

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at q = 2 is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic Ising model at any temperature has the same polynomial mixing time bound.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences

We study the Glauber dynamics for Ising model on (sequences of) dense graphs. We view the dense graphs through the lens of graphons [19]. For the ferromagnetic Ising model with inverse temperature β on a convergent sequence of graphs {Gn} with limit graphon W we show fast mixing of the Glauber dynamics if βλ1(W ) < 1 and slow (torpid) mixing if βλ1(W ) > 1 (where λ1(W ) is the largest eigenvalu...

متن کامل

Rapid mixing for the non-critical random-cluster model on the square lattice

We consider the random-cluster model with parameters p ∈ (0, 1) and q ∈ N on finite boxes in the two-dimensional square lattice for non-critical values of p, that is p 6= pc = √ q/(1 + √ q). We prove that the spectral gap of the continuous-time heat-bath dynamics for this model with free or wired boundary conditions is bounded from below by a constant. The proof uses the standard technique of b...

متن کامل

Quasi-polynomial Mixing of Critical 2d Random Cluster Models

We study the Glauber dynamics for the random cluster (FK) model on the torus (Z/nZ) with parameters (p, q), for q ∈ (1, 4] and p the critical point pc. The dynamics is believed to undergo a critical slowdown, with its continuous-time mixing time transitioning from O(logn) for p 6= pc to a power-law in n at p = pc. This was verified at p 6= pc by Blanca and Sinclair, whereas at the critical p = ...

متن کامل

Markov chain Monte Carlo algorithm for the mean field random-cluster model

The random-cluster model has emerged as a unifying framework for studying random graphs, physical spin systems, and electrical networks [6]. Given a base graph G = (V,E), the random-cluster model consists of a probability distribution π over subsets of E, where p ∈ [0, 1] and q > 0 are real parameters determining the bond and cluster weights respectively. For q ≥ 1, there is a value of p = pc a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017